The Simultaneous Strong Metric Dimension of Graph Families

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Simultaneous Local Metric Dimension of Graph Families

In a graph G = (V, E), a vertex v ∈ V is said to distinguish two vertices x and y if dG(v, x) 6= dG(v, y). A set S ⊆ V is said to be a local metric generator for G if any pair of adjacent vertices of G is distinguished by some element of S. A minimum local metric generator is called a local metric basis and its cardinality the local metric dimension of G. A set S ⊆ V is said to be a simultaneou...

متن کامل

Adjacency metric dimension of the 2-absorbing ideals graph

Let Γ=(V,E) be a graph and ‎W_(‎a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),‎…‎ ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...

متن کامل

On Metric Dimension of Two Constructed Families from Antiprism Graph

In this paper we compute the metric dimension of two families of graphs constructed from antiprism graph.

متن کامل

The metric dimension and girth of graphs

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

متن کامل

On the metric dimension of some families of graphs

The concept of (minimum) resolving set has proved to be useful and/or related to a variety of fields such as Chemistry [3,6], Robotic Navigation [5,8] and Combinatorial Search and Optimization [7]. This work is devoted to evaluating the so-called metric dimension of a finite connected graph, i.e., the minimum cardinality of a resolving set, for a number of graph families, as long as to study it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society

سال: 2015

ISSN: 0126-6705,2180-4206

DOI: 10.1007/s40840-015-0268-0